Timed Atomic Commitment
نویسندگان
چکیده
In a large class of hard-real-time control applications, components execute concurrently on distributed nodes and must coordinate, under timing constraints, to perform the control task. As such, they perform a type of atomic commitment. Traditional atomic commitment differs, however, because there are no timing constraints; agreement is eventual. We therefore define timed atomic commitment (TAC) which requires the processes to be functionally consistent, but allows the outcome to include an exceptional state, indicating that timing constraints have been violated. We then present centralized and decentralized protocols to implement TAC and a high-level language construct that facilitates its use in distributed real-time programming.
منابع مشابه
Timed Commitments
We introduce and construct timed commitment schemes, an extension to the standard notion of commitments in which a potential forced opening phase permits the receiver to recover (with effort) the committed value without the help of the committer. An important application of our timed-commitment scheme is contract signing: two mutually suspicious parties wish to exchange signatures on a contract...
متن کاملSemantic Models for a Language with Timed Atomic Actions
An operational and a denotational semantic model for a language incorporating time related aspects, viz. timed atomic actions and integration, is presented. With timed atomic actions we mean atomic actions each provided with a time stamp, which records the time at which the atomic action should be executed. Integration of a statement over some non-empty subset of the time domain gives rise to t...
متن کاملConsensus in Asynchronous Distributed Systems
The distributed consensus problem arises when several processes need to reach a common decision despite failures. The importance of this problem is due to its omnipresence in distributed computation: we need consensus to implement reliable communications, atomic commitment, consistency checks, resources allocations etc. The solvability of this problem is strictly related to the nature of the sy...
متن کاملTimed Uniform Atomic Broadcast in Presence of Crash and Timing Faults
∆-Timed Atomic Broadcast is the broadcast ensuring that all correct processes deliver the same messages in the same order, and that delivery latency of any message broadcast by any correct process is some predetermined time ∆ or less. In this paper, we propose a ∆-timed atomic broadcast algorithm in a synchronous system where communication delay is bounded by a known constant d and processes su...
متن کاملSimple Bounded MTL Model Checking for Discrete Timed Automata (extended abstract)
We present a new translation of Metric Temporal Logic to the Linear Temporal Logic with a new set of the atomic propositions. We investigate a SAT-based bounded model checking method for Metric Temporal Logic that is interpreted over linear discrete infinite time models generated by discrete timed automata. We show how to implement the bounded model checking technique for Linear Temporal Logic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 40 شماره
صفحات -
تاریخ انتشار 1991